Intersection Type Assignment Systems

نویسنده

  • Steffen van Bakel
چکیده

This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compare in detail variants that have been defined in the past. It presents the essential intersection type assignment system, that will prove to be as powerful as the wellknown BCD-system. It is essential in the following sense: it is an almost syntax directed system that satisfies all major properties of the BCD-system, and the types used are the representatives of equivalence classes of types in the BCD-system. The set of typeable terms can be characterized in the same way, the system is complete with respect to the simple type semantics, and it has the principal type property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

A Complete Characterization of Complete Intersection-Type Theories

We characterize those intersection-type theories which yield complete intersection-type assignment systems for λ-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics and the F-semantics.

متن کامل

Partial Intersection Type Assignment in Applicative Term Rewriting Systems

This paper introduces a notion of partial type assignment on applicative term rewriting systems that is based on a combination of an essential intersection type assignment system, and the type assignment system as defined for ML [16], both extensions of Curry’s type assignment system [11]. Terms and rewrite rules will be written as trees, and type assignment will consists of assigning intersect...

متن کامل

Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and -rule?

We define two type assignment systems for first-order rewriting extended with application, -abstraction, and -reduction (TRS+ ). The types used in these systems are a combination of (!-free) intersection and polymorphic types. The first system is the general one, for which we prove a subject reduction theorem and show that all typeable terms are strongly normalisable. The second is a decidable ...

متن کامل

Type assignment and termination of interaction nets

Interaction nets have proved to be a useful tool for the study of computational aspects of diierent formalisms (e.g.-calculus, term rewriting systems), but they are also a programming paradigm in themselves, and this is actually how they were introduced by Lafont. In this paper we consider semi-simple interaction nets as a programming language, and present a type assignment system using interse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 151  شماره 

صفحات  -

تاریخ انتشار 1995